package leetcode.D500.T406;

import util.GraphUtil;

public class M406 {
    public static void main(String[] args) {
        int[][] people = GraphUtil.parseGraph("[[7,0],[4,4],[7,1],[5,0],[6,1],[5,2]]");
        int[][] newPeople = new Solution().reconstructQueue(people);
        GraphUtil.printGraph(newPeople);
    }
}
